A Semi-lattice of Four-valued Literal-paraconsistent-paracomplete Logics
نویسندگان
چکیده
منابع مشابه
Literal-paraconsistent and literal-paracomplete matrices
We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class of all these matrices, we give conditions for the maximality of these logics and we study in detail ...
متن کاملAlgebraization of logics defined by literal-paraconsistent or literal-paracomplete matrices
We study the algebraizability of the logics constructed using literal-paraconsistent and literal-paracomplete matrices described by Lewin and Mikenbergin[11] proving that theyare all algebraizable in the sense of Blok We study the algebraizability of the logics constructed using literal-paraconsistent and literal-paracomplete matrices described by Lewin and Mikenberg in [11], proving that they ...
متن کاملParaconsistent Resolution for Four-valued Description Logics
In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve this in two steps: First we give a simple way to make anyALC based ontology 4-valued satisfiable, and then we study a sound and complete paraconsistent ordered-resolution decision procedure for our 4-valuedALC. Our approach can be...
متن کاملFour-valued Logics for Paraconsistent Reasoning
A drawback of many logics for reasoning on Semantic Web ontologies is the Principle of Explosion in case of inconsistent data. Considering a four-valued semantics, inconsistencies can be tolerated such that paraconsistency is obtained. We extend Belnap’s four-valued logic to a four-valued first-order logic with implication and equality, and we develop a method for translating formulas to a repr...
متن کاملMaximally Paraconsistent Three-Valued Logics
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper, we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Section of Logic
سال: 2020
ISSN: 2449-836X,0138-0680
DOI: 10.18778/0138-0680.2020.24